Flexible Algorithms: Overview of a Beginners' Course
نویسندگان
چکیده
منابع مشابه
Indexes and Algorithms for Scalable and Flexible Instant Overview Search
There is an increasing interest on recommending to the user instantly (during typing characters) queries and query results. This is evidenced by the emergence of several systems that offer such functionalities (e.g. Google Instant Search, Facebook for social searching, IMDB for movie searching, etc). In this thesis we consider more informative recommendations based on various precomputed aggreg...
متن کاملChapter 1: Course Overview
We have many goals for this course. Our primary goal is for you to learn to appreciate and use the fundamental design principles of modularity and abstraction in a variety of contexts from electrical engineering and computer science. To achieve this goal, we will study electrical engi neering (EE) and computer science (CS) largely from the perspective of how to build systems that interact with...
متن کاملLOGI: A Didactic Tool for a Beginners' Course in Logic (System Description)
LOGI is a didactic software designed for a basic course of Logic. We developed it as an extension of the course-ware Language, Proof and Logic (LPL) by Plummer, Barwise, and Etchemendy, in particular of Tarski’s World (TW): the latter features simple virtual worlds populated by blocks and equipped with a first order language to about them; this helps students to understand the language of logic...
متن کاملA course on Combinatorial Algorithms
The paper presents a course on Combinatorial Algorithms that is based on the drafts of the author that he used while teaching the course in the Department of Informatics and Applied Mathematics of Yerevan State University, Armenia from February 2007 to June 2007.
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Distributed Systems Online
سال: 2006
ISSN: 1541-4922
DOI: 10.1109/mdso.2006.65